A Non-trigonometric, Pseudo Area Preserving, Polyline Smoothing Algorithm
نویسندگان
چکیده
A line-smoothing algorithm based on simple arithmetic is presented and its characteristics are analyzed for various implementations. The algorithm is efficient because it can be implemented using only simple integer arithmetic, with no square root or trigonometric calculations. The algorithm is applicable to graph drawing applications that require smooth polylines between graph nodes. Though the algorithm is efficient, it is sensitive to seemingly minor implementation details which make it an illustrative and illuminating student/classroom exercise for the discussion of integer round-off, integer overflow, and the importance of implementation details.
منابع مشابه
TENSION QUARTIC TRIGONOMETRIC BÉZIER CURVES PRESERVING INTERPOLATION CURVES SHAPE
In this paper simple quartic trigonometric polynomial blending functions, with a tensionparameter, are presented. These type of functions are useful for constructing trigonometricB´ezier curves and surfaces, they can be applied to construct continuous shape preservinginterpolation spline curves with shape parameters. To better visualize objects and graphics atension parameter is included. In th...
متن کاملA Graph Drawing Algorithm for the Game of Sprouts
A graph drawing algorithm for the Game of Sprouts is presented. The algorithm guarantees that the polylines that connect graph nodes are drawn smoothly and that they maintain reasonable distance from other graph polylines. Vertices of the graph are moved using a combination of repulsive forces and smoothing forces. The repulsive forces come from all other visible graph nodes and visible polylin...
متن کاملA smooth, obstacle-avoiding curve
An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosing a desirable path (for example the shortest path), and smoothing the polyline path to give a curve that avoids the obstacles. This paper is concerned with the last stage in the process; it assumes the existence of an ...
متن کاملPreserving Coincidence and Incidence Topologies in Saalfeld's Polyline Simplification Algorithm
In this paper, we firstly describe two topological configurations that are not considered by Saalfeld’s polyline simplification algorithm: the coincidence topology, concerning the overlapping of two polylines or the overlapping of a feature point and a polyline, and the incidence topology, concerning the incidence of two polylines without having the incidence point represented as a common verte...
متن کاملSmoothing imprecise 1-dimensional terrains
An imprecise 1-dimensional terrain is an x-monotone polyline where the y-coordinate of each vertex is not fixed but only constrained to a given interval. In this paper we study four different optimization measures for imprecise 1-dimensional terrains, related to obtaining smooth terrains. In particular, we present algorithms to minimize the largest and total turning angle, and to maximize the s...
متن کامل